Spanning trees of locally finite graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally connected spanning trees on graphs

A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v ∈ V (G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.

متن کامل

Counting the number of spanning trees of graphs

A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

متن کامل

NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

متن کامل

Infinite Paths in Locally Finite Graphs and in Their Spanning Trees

The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disjoint ones) in locally finite graphs and in spanning trees of such graphs.

متن کامل

Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs

A spanning tree T of a graph G is called a homeomorphically irreducible spanning tree (HIST) if T does not contain vertices of degree 2. A graph G is called locally connected if for every vertex v ∈ V (G), the subgraph induced by the neighborhood of v is connected. In this paper, we prove that every connected and locally connected graph with more than 3 vertices contains a HIST. Consequently, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 1989

ISSN: 0011-4642,1572-9141

DOI: 10.21136/cmj.1989.102294